Extension of efficient, swept-integration-based conservative remapping method for meshes with changing connectivity

نویسنده

  • M. Shashkov
چکیده

In numerical simulations of fluid flow, the choice of the computational mesh is crucial. Traditionally, there have been two viewpoints, utilizing the Lagrangian or the Eulerian framework, each with its own advantages and disadvantages. In a pioneering paper [1], Hirt et al. developed the formalism for a mesh whose motion could be determined as an independent degree of freedom, and showed that this general framework could be used to combine the best properties of Lagrangian and Eulerian methods. This class of methods has been termed Arbitrary Lagrangian–Eulerian or ALE. It is most usual to separate the ALE algorithm into three individual phases. These are the following: (1) a Lagrangian phase, in which the solution and mesh are updated, (2) a rezoning phase, in which the nodes of the computational mesh are moved to a more optimal position, and (3) a remapping phase, in which the Lagrangian solution is interpolated onto the rezoned mesh. We are interested in the development of staggered ALE methods for meshes whose connectivity may

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An efficient linearity and bound preserving conservative interpolation (remapping) on polyhedral meshes

An accurate conservative interpolation (remapping) algorithm is an essential component of most Arbitrary Lagrangian–Eulerian (ALE) methods. In this paper, we describe an efficient linearity and bound preserving method for polyhedral meshes. The algorithm is based on reconstruction, approximate integration and conservative redistribution. We validate our method with a suite of numerical examples...

متن کامل

On simplifying 'incremental remap'-based transport schemes

The flux-form incremental remapping transport scheme introduced by Dukowicz and Baumgardner [1] converts the transport problem into a remapping problem. This involves identifying overlap areas between quadrilateral flux-areas and regular square grid cells which is non-trivial and leads to some algorithm complexity. In the simpler swept area approach (originally introduced by Hirt et al. [2]) th...

متن کامل

The Error-Minimization-Based Strategy for Moving Mesh Methods

The typical elements in a numerical simulation of fluid flow using moving meshes are a time integration scheme, a rezone method in which a new mesh is defined, and a remapping (conservative interpolation) in which a solution is transferred to the new mesh. The objective of the rezone method is to move the computational mesh to improve the robustness, accuracy and eventually efficiency of the si...

متن کامل

OPTIMAL DECOMPOSITION OF FINITE ELEMENT MESHES VIA K-MEDIAN METHODOLOGY AND DIFFERENT METAHEURISTICS

In this paper the performance of four well-known metaheuristics consisting of Artificial Bee Colony (ABC), Biogeographic Based Optimization (BBO), Harmony Search (HS) and Teaching Learning Based Optimization (TLBO) are investigated on optimal domain decomposition for parallel computing. A clique graph is used for transforming the connectivity of a finite element model (FEM) into that of the cor...

متن کامل

توسعه یک روش عددی حجم محدود برای ارزیابی عملکرد هیدرودینامیکی سازه های دریایی

Development of a compatible computational fluid dynamics procedure to investigate rigid and fixed/free coastal and offshore structures hydrodynamics in a time-dependent one/two phase flow of viscous incompressible fluids is presented. Differential governing equations are discretised using finite volume approach based on a colocated arrangement. The conservation equations for mass and momentum a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007